MCM: An Efficient Geometric Constraint Method for Robust Local Feature Matching

نویسندگان

  • Kai Chen
  • Yi Zhou
  • Qi Zheng
  • Xiaokang Yang
  • Li Song
چکیده

Local feature matching is not robust to extract correct correspondences under many conditions, such as images with general deformations and repetitive patterns. To solve this problem, this paper proposes a new geometric constraint method: Maximal Clique Matching (MCM). In MCM, the global geometric constraint problem can be expressed as the maximal clique problem in graph theory. MCM starts from building a geometric correspondence graph (GCG) based upon the pairwise geometric information in local features, and then an efficient heuristic approximation algorithm is developed to get the global geometric relationships by finding the maximal cliques in GCG. Given the characteristics of the global optimality of maximal cliques, MCM is robust to occlusion, clutter, deformations and repetitive patterns. We evaluated the method using two public datasets. Results show that our method outperforms other up-to-date techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Low-altitude Image Matching Based on Local Region Constraint and Feature Similarity Confidence

Improving the matching reliability of low-altitude images is one of the most challenging issues in recent years, particularly for images with large viewpoint variation. In this study, an approach for low-altitude remote sensing image matching that is robust to the geometric transformation caused by viewpoint change is proposed. First, multiresolution local regions are extracted from the images ...

متن کامل

A novel image registration approach via combining local features and geometric invariants

Image registration is widely used in many fields, but the adaptability of the existing methods is limited. This work proposes a novel image registration method with high precision for various complex applications. In this framework, the registration problem is divided into two stages. First, we detect and describe scale-invariant feature points using modified computer vision-oriented fast and r...

متن کامل

Robust Dense Matching Using Local and Global Geometric Constraints

A new robust dense matching algorithm is introduced in this paper: The algorithm starts from matching the most textured points, then a match propagation algorithm is developed with the best first strategy to densib the matches. Next, the matching map is regularised by using the local geometric constraints encoded by planar affine applications and by using the global geometric constraint encoded...

متن کامل

Performance Evaluation of Local Detectors in the Presence of Noise for Multi-Sensor Remote Sensing Image Matching

Automatic, efficient, accurate, and stable image matching is one of the most critical issues in remote sensing, photogrammetry, and machine vision. In recent decades, various algorithms have been proposed based on the feature-based framework, which concentrates on detecting and describing local features. Understanding the characteristics of different matching algorithms in various applications ...

متن کامل

A novel Local feature descriptor using the Mercator projection for 3D object recognition

Point cloud processing is a rapidly growing research area of computer vision. Introducing of cheap range sensors has made a great interest in the point cloud processing and 3D object recognition. 3D object recognition methods can be divided into two categories: global and local feature-based methods. Global features describe the entire model shape whereas local features encode the neighborhood ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011